package com.example.leetcode.tree;

import com.example.leetcode.tree.common.TreeNode;
import com.example.leetcode.tree.common.TreeUtils;

import java.util.List;

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class Solution314 {
    public List<List<Integer>> verticalOrder(TreeNode root) {
        return TreeUtils.verticalOrder(root);
    }
}
public class leetcode314 {
    public static void main(String[] args) {
        Solution314 solution314 = new Solution314();
        Integer[] root = {3,9,8,4,0,1,7,null,null,null,2,5};
        System.out.println(solution314.verticalOrder(TreeUtils.generateLeetcodeTree(root)));
    }

}
